Nonerasing Turing machines: a frontier between a decidable halting problem and universality
نویسندگان
چکیده
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملAsymptotic behavior and halting probability of Turing Machines
Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps done by a computer program during its execution, can be defined such that the probability that such program will halt after that time is smaller than any arbitrary fixed value. Consistency with known results and consequences are also discussed. 1 Int...
متن کاملQuantum Turing Machines: Local Transition, Preparation, Measurement, and Halting
The Church-Turing thesis 2 states that to be computable is to be computable by a Turing machine and the modern discipline in computational complexity theory states that to be efficiently computable is to be computable by a Turing machine within polynomial steps in the length of the input data. However, Feynman pointed out that a Turing machine cannot simulate a quantum mechanical process effici...
متن کاملSome relations between quantum Turing machines and Turing machines
For quantum Turing machines we present three elements: Its components, its time evolution operator and its local transition function. The components are related with the components of deterministic Turing machines, the time evolution operator is related with the evolution of reversible Turing machines and the local transition function is related with the transition function of probabilistic and...
متن کاملMeasurement-Based Quantum Turing Machines and their Universality
Quantum measurement is universal for quantum computation (Nielsen [8], Leung [5,6], Raussendorf [13,14]). This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90038-8